An Experimental Investigation into the Rank Function of the Heterogeneous Earliest Finish Time Scheduling Algorithm
نویسندگان
چکیده
This paper considers the Heterogeneous Earliest Finish Time (HEFT) algorithm for scheduling the tasks of an application, represented by a directed acyclic graph, onto a bounded number of heterogeneous machines. We focus on the appropriate selection of the weight for the nodes and edges of the graph, and experiment with a number of different schemes for computing these weights. Our findings indicate that the length of the schedule produced may be affected significantly by the scheme used, and suggest that the mean value based approach used by HEFT may not be a particularly good choice.
منابع مشابه
HSIP: A Novel Task Scheduling Algorithm for Heterogeneous Computing
The grid computing system can support the execution of computationally intensive parallel and distributive applications. The main characteristics of grid computing and heterogeneous computing system are similar. A novel scheduling algorithm, called NHEFT is proposed in this paper to enhance the functions of heterogeneous Earliest-Finish time (HEFT) algorithm. The NHEFT algorithm works for a bou...
متن کاملA new Shuffled Genetic-based Task Scheduling Algorithm in Heterogeneous Distributed Systems
Distributed systems such as Grid- and Cloud Computing provision web services to their users in all of the world. One of the most important concerns which service providers encounter is to handle total cost of ownership (TCO). The large part of TCO is related to power consumption due to inefficient resource management. Task scheduling module as a key component can has drastic impact on both user...
متن کاملImplementation of Multi-objective Evolutionary Algorithm for Task Scheduling in Heterogeneous Distributed Systems
This paper presents an effective method for task scheduling in heterogeneous distributed systems. Its objective is to minimize the last task’s finish time and to maximize the system reliability probability. The optimum is carried out through a non-domination sort genetic algorithm. The experimental results based on both randomly generated graphs and the graphs of some real applications showed t...
متن کاملHigh performance real-time scheduling of multiple mixed-criticality functions in heterogeneous distributed embedded systems
The architectures of high-end embedded system have evolved into heterogeneous distributed integrated architectures. The scheduling of multiple distributed mixed-criticality functions in heterogeneous distributed embedded systems is a considerable challenge because of the different requirements of systems and functions. Overall scheduling length (i.e., makespan) is the main concern in system per...
متن کاملResource preprocessing and optimal task scheduling in cloud computing environments
Cloud computing came into being and is currently an essential infrastructure of many commerce facilities. To achieve the promising potentials of cloud computing, effective and efficient scheduling algorithms are fundamentally important. However, conventional scheduling methodology encounters a number of challenges. During the tasks scheduling in cloud systems, how to make full use of resources ...
متن کامل